Three Characterizations of Non-binary Correlation-Immune and Resilient Functions
نویسندگان
چکیده
A function f (X 1 ; X 2 ; : : : ; X n) is said to be t th-order correlation-immune if the ran-ally, if all possible outputs are equally likely, then f is called a t ?resilient function. In this paper, we provide three diierent characterizations of t th-order correlation immune functions and resilient functions where the random variable is over GF (q). The rst is in terms of the structure of a certain associated matrix. The second characterization involves Fourier transforms. The third characterization establishes the equivalence of resilient functions and large sets of orthogonal arrays. 1 Deenitions Let GF(q) denote the Galois Field with q elements, where q = p a is a prime power. Let f : GF (q)] n ?! GF (q)] m be a function and let fX 1 ; X 2 ; : : : ; X n g be the set of random input variables assuming values from GF(q) with independent equiprobable distributions (that is, every possible input vector occurs with equal probability 1=q n). Such a function is said to have balanced input. Let fZ 1 ; Z 2 ; : : : ; Z m g denote the set of output variables of the function f. The function f is said to be correlation-immune with respect to T f1; 2; : : : ; ng (or equivalently independent of T) if the probability distribution of the random variable
منابع مشابه
Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography
We extend the notions of correlation-immune functions and resilient functions to functions over any finite alphabet. A previous result due to Gopalakrishnan and Stinson is generalized as we give an orthogonal array characterization, a Fourier transform and a matrix characterization for correlation-immune and resilient functions over any finite alphabet endowed with the structure of an Abelian g...
متن کاملSpectral Analysis of High Order Correlation Immune Functions
We use the recent results on the spectral structure of correlation immune and resilient Boolean functions for the investigations of high order correlation immune functions. At rst, we give simple proofs of some theorems where only long proofs were known. Next, we introduce the matrix of nonzero Walsh coeecients and establish important properties of this matrix. We use these properties to prove ...
متن کاملAutocorrelation Coefficients and Correlation Immunity of Boolean Functions
We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute indicator of resilient functions that improves significantly (for m > (n − 3)/2) the bound of Zheng and Zhang [18] on this value. We prove new upper bound for the number of nonlinear variables in high resilient Boolean function. T...
متن کاملBDD Based Construction of Resilient Functions
The construction of modern cryptographic systems relies on the so-called resilient Boolean functions, a special class of Boolean functions that possesses a balance between a high level of nonlinearity and correlation immunity. In this paper, we discuss the problem of the compact representation and efficient construction of resilient functions. Binary Decision Diagrams (BDDs) were extensively us...
متن کاملConstruction of resilient functions over a finite alphabet
We extend the notions of correlation-immune functions and resilient functions to functions over any nite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any nite alphabet. This leads to a generalization of som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 5 شماره
صفحات -
تاریخ انتشار 1995